Modelling the brain as a n Apollonian network
نویسندگان
چکیده
Gian Luca Pellegrini, Lucilla de Arcangelis, Hans J. Herrmann and Carla Perrone-Capano 1 Department of Physical Sciences, University of Naples Federico II, 80125 Napoli, Italy 2 Dept. of Information Engineering and CNISM, Second University of Naples, 81031 Aversa (CE), Italy 3 Computational Physics, IfB, ETH-Hönggerberg, Schafmattstr. 6, 8093 Zürich, Switzerland 4 Dept. of Biological Sciences, University of Naples ”Federico II”, 80134, Naples, Italy and IGB ”A.Buzzati Traverso”, CNR, 80131 Naples, Italy.
منابع مشابه
Long Paths in Random Apollonian Networks
We consider the length L(n) of the longest path in a randomly generated Apollonian Network (ApN) An. We show that w.h.p. L(n) ≤ ne− log c n for any constant c < 2/3.
متن کاملModelling of Stress-Strain Behaviour of Clayey Soils Using Artificial Neural Network
In this research, behaviour of clayey soils under triaxial loading is studied using Neural Network. The models have been prepared to predict the stress-strain behaviour of remolded clays under undrained condition. The advantage of the model developed is that simple parameters such as physical characteristics of soils like water content, fine content, Atterberg limits and so on, are used to mode...
متن کاملModelling of Stress-Strain Behaviour of Clayey Soils Using Artificial Neural Network
In this research, behaviour of clayey soils under triaxial loading is studied using Neural Network. The models have been prepared to predict the stress-strain behaviour of remolded clays under undrained condition. The advantage of the model developed is that simple parameters such as physical characteristics of soils like water content, fine content, Atterberg limits and so on, are used to mode...
متن کاملMaximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs
The Apollonian networks display the remarkable power-law and small-world properties as observed in most realistic networked systems. Their dual graphs are extended Tower of Hanoi graphs, which are obtained from the Tower of Hanoi graphs by adding a special vertex linked to all its three extreme vertices. In this paper, we study analytically maximum matchings and minimum dominating sets in Apoll...
متن کامل. so c - ph ] 3 1 O ct 2 00 6 Vertex labeling and routing in expanded Apollonian networks
We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered. We introduce a labeling of their vertices that allows to determine a shortest path routing between any two vertices of the network based only on the labels.
متن کامل